Predecessor machines
نویسندگان
چکیده
منابع مشابه
Predecessor problem on smooth distributions
We follow a research thread studying the predecessor problem on “smooth” distribution families. We propose a conceptually simpler solution utilizing wellknown results from much better studied variant of the problem that assumes nothing about the input. As a side effect, we are able to extend the range of handled input distributions for the most studied case needing expected O (log log n) time, ...
متن کاملSolving Games without Controllable Predecessor
Two-player games are a useful formalism for the synthesis of reactive systems. The traditional approach to solving such games iteratively computes the set of winning states for one of the players. This requires keeping track of all discovered winning states and can lead to space explosion even when using efficient symbolic representations. We propose a new method for solving reachability games....
متن کاملOptimised Predecessor Data Structures for Internal Memory
We demonstrate the importance of reducing misses in the translation-lookaside bu er (TLB) for obtaining good performance on modern computer architectures. We focus on data structures for the dynamic predecessor problem: to maintain a set S of keys from a totally ordered universe under insertions, deletions and predecessor queries. We give two general techniques for simultaneously reducing cache...
متن کاملThe Batched Predecessor Problem in External Memory
We give lower bounds for the batched predecessor problem in external memory. Given the underlying sorted set S of size n, and a sorted query Q of size x ≤ n, 0 ≤ c < 1, we study tradeoffs between the searching cost, and the cost to preprocess S. We give lower bounds in three external memory models: the I/O comparison model, I/O pointer-machine model, and the indexability model. Our results show...
متن کاملThe Bit Complexity of the Predecessor Problem
Tight bound of 2n ? 1 bits on the communication complexity of \The Pre-decessor" problem in a synchronous ring (previously known as \The last in a synchronous ring" problem) is presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1974
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(74)80055-3